Generalizing the Steiner-Lehmus theorem using the Gröbner cover

نویسندگان

  • Antonio Montes
  • Tomás Recio
چکیده

In this note we present an application of a new tool (the Gröbner cover method, to discuss parametric polynomial systems of quations) in the realm of automatic discovery of theorems in elementary geometry. Namely, we describe, through a relevant example, ow the Gröbner cover algorithm is particularly well suited to obtain the missing hypotheses for a given geometric statement to hold rue. We deal with the following problem: to describe the triangles that have at least two bisectors of equal length. The case of two nner bisectors is the well known, XIX century old, Steiner–Lehmus theorem, but the general case of inner and outer bisectors has een only recently addressed. We show how the Gröbner cover method automatically provides, while yielding more insight than hrough any other method, the conditions for a triangle to have two equal bisectors of whatever kind. 2013 IMACS. Published by Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trigonometric Proof of Steiner-lehmus Theorem in Hyperbolic Geometry

In this note, we present a short trigonometric proof to the Steiner Lehmus Theorem in hyperbolic geometry. 2000 Mathematics Subject Classification: 30F45, 20N99, 51B10, 51M10

متن کامل

A Short Trigonometric Proof of the Steiner-Lehmus Theorem

We give a short trigonometric proof of the Steiner-Lehmus theorem. The well known Steiner-Lehmus theorem states that if the internal angle bisectors of two angles of a triangle are equal, then the triangle is isosceles. Unlike its trivial converse, this challenging statement has attracted a lot of attention since 1840, when Professor Lehmus of Berlin wrote to Sturm asking for a purely geometric...

متن کامل

Computing the Canonical Representation of Constructible Sets

In the basic paper defining the Gröbner Cover [16] for discussing parametric polynomial systems of equations, we 8 introduced algorithms that have been improved since then. We used our own algorithm buildtree for computing 9 the initial Comprehensive Gröbner System (CGS), needed for the Gröbner Cover, now substituted in the Singular [7] 10 library “grobcov.lib” by themore efficientKapur–Sun–Wan...

متن کامل

Software for Discussing Parametric Polynomial Systems: The Gröbner Cover

We present the canonical Gröbner Cover method for discussing parametric polynomial systems of equations. Its objective is to decompose the parameter space into subsets (segments) for which it exists a generalized reduced Gröbner basis in the whole segment with fixed set of leading power products on it. Wibmer’s Theorem guarantees its existence. The Gröbner Cover is designed in a joint paper of ...

متن کامل

The canonical ring of a stacky curve

Generalizing the classical theorems of Max Noether and Petri, we describe generators and relations for the canonical ring of a stacky curve, including an explicit Gröbner basis. We work in a general algebro-geometric context and treat log canonical and spin canonical rings as well. As an application, we give an explicit presentation for graded rings of modular forms arising from finite-area quo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematics and Computers in Simulation

دوره 104  شماره 

صفحات  -

تاریخ انتشار 2014